The Polytope of Non-Crossing Graphs on a Planar Point Set
نویسندگان
چکیده
منابع مشابه
Coloring planar Toeplitz graphs and the stable set polytope
Cliques and odd cycles are well known to induce facet-de.ning inequalities for the stable set polytope. In graph coloring cliques are a class of n-critical graphs whereas odd cycles represent the class of 3-critical graphs. In the .rst part of this paper we generalize both notions to (Kn \ e)-cycles, a new class of n-critical graphs, and discuss some implications for the class of in.nite planar...
متن کاملOn the Stable Set Polytope of Claw-Free Graphs
In this thesis we focus our attention on the stable set polytope of claw-free graphs. This problem has been open for many years and albeit all the efforts engaged during those last three years, it is still open. This does not mean that no progress has been made and we hope to the contrary that this thesis contains some important advances and that the reader will share this point of view. Unders...
متن کاملOn the Crossing Number of Almost Planar Graphs
If G is a plane graph and x, y ∈ V (G), then the dual distance of x and y is equal to the minimum number of crossings of G with a closed curve in the plane joining x and y. Riskin [7] proved that if G0 is a 3connected cubic planar graph, and x, y are its vertices at dual distance d, then the crossing number of the graph G0 + xy is equal to d. Riskin asked if his result holds for arbitrary 3-con...
متن کاملA QPTAS for the base of the number of crossing-free structures on a planar point set
The number of triangulations of a planar n point set S is known to be c, where the base c lies between 8.65 and 30. Similarly, the number of spanning trees on S is known to be d, where the base d lies between 12.52 and 141.07. The fastest known algorithm for counting triangulations of S runs in O∗(2n) time while that for counting spanning trees on S enumerates them in Ω(12.52) time. The fastest...
متن کاملOn the number of rectangulations of a planar point set
We investigate the number of different ways in which a rectangle containing a set of n noncorectilinear points can be partitioned into smaller rectangles by n (non-intersecting) segments, such that every point lies on a segment. We show that when the relative order of the points forms a separable permutation, the number of rectangulations is exactly the (n+ 1)st Baxter number. We also show that...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 2004
ISSN: 0179-5376,1432-0444
DOI: 10.1007/s00454-004-1143-1